Merit Functions and Descent Algorithms for a Class of Variational Inequality Problems
نویسنده
چکیده
We consider a variational inequality problem, where the cost mapping is the sum of a single-valued mapping and the subdifferential mapping of a convex function. For this problem we introduce a new class of equivalent optimization formulations; based on them, we also provide the first convergence analysis of descent algorithms for the problem. The optimization formulations constitute generalizations of those presented by Auchmuty [Auc89], and the descent algorithms are likewise generalizations of those of Fukushima [Fuk92], Larsson and Patriksson [LaP94] and several others, for variational inequality problems with single-valued cost mappings.
منابع مشابه
A New Merit Function and an Sqp Method for Non-strictly Monotone Variational Inequalities
Merit functions utilized to monitor the convergence of sequential quadratic programming (SQP) methods for nonlinear programs and variational inequality problems have in common that they include a penalty function for the explicit constraints, the value of the penalty parameter for which is subject to the requirement of being large enough compared to estimates of the optimal Lagrange multipliers...
متن کاملA Class of Gap Functions for Variational
Recently, Auchmuty (1989) has introduced a new class of merit functions, or optimization formulations, for variational inequalities in nite-dimensional space. We develop and generalize Auchmuty's results, and relate his class of merit functions to other works done in this eld. Especially, we investigate diierentiability and con-vexity properties, and present characterizations of the set of solu...
متن کاملA class of gap functions for variational inequalities
Recently, Auchmuty (1989) has introduced a new class of merit functions, or optimization formulations, for variational inequalities in finite-dimensional space. We develop and generalize Auchmuty’s results, and relate his class of merit functions to other works done in this field. Especially, we investigate differentiability and convexity properties, and present characterizations of the set of ...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملGap Functions and Descent Methods for Minty Variational Inequality
A new class of gap functions associated to the variational inequality introduced by Minty is defined. Descent methods for the minimization of the gap functions are analysed in order to develop exact and inexact line-search algorithms for solving strictly and strongly monotone variational inequalities, respectively.
متن کامل